MOSMA: Multi-Objective Slime Mould Algorithm Based on Elitist Non-Dominated Sorting
نویسندگان
چکیده
This paper proposes a multi-objective Slime Mould Algorithm (MOSMA), variant of the recently-developed (SMA) for handling optimization problems in industries. Recently, problems, several meta-heuristic and evolutionary techniques have been suggested community. These methods tend to suffer from low-quality solutions when evaluating (MOO) than addressing objective functions identifying Pareto optimal solutions’ accurate estimation increasing distribution throughout all objectives. The SMA method follows logic gained oscillation behaviors slime mould laboratory experiments. algorithm shows powerful performance compared other well-established methods, it is designed by incorporating food path using positive-negative feedback system. proposed MOSMA employs same underlying mechanisms convergence combined with an elitist non-dominated sorting approach estimate solutions. As posteriori method, formulation maintained MOSMA, crowding distance operator utilized ensure coverage across To verify validate 41 different case studies, including unconstrained, constrained, real-world engineering design are considered. Multiobjective Symbiotic-Organism Search (MOSOS), Multi-objective Evolutionary Based on Decomposition (MOEA/D), Water-Cycle (MOWCA) terms metrics, such as Generational Distance (GD), Inverted (IGD), Maximum Spread (MS), Spacing, Run-time. simulation results demonstrated superiority realizing high-quality linear, nonlinear, continuous, discrete front. indicate effectiveness solving complicated problems. research will be backed up extra online service guidance paper’s source code at https://premkumarmanoharan.wixsite.com/mysite xmlns:xlink="http://www.w3.org/1999/xlink">https://aliasgharheidari.com/SMA.html . Also, shared public
منابع مشابه
A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II
Abstract. Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) computational complexity (where is the number of objectives and is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algor...
متن کاملA Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimisation: NSGA-II
Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) O(mN3) computational complexity (where m is the number of objectives and N is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algo...
متن کاملAn Adapted Non-dominated Sorting Algorithm (ANSA) for Solving Multi Objective Trip Distribution Problem
Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملMulti-objective optimal path planning using elitist non-dominated sorting genetic algorithms
A multi-objective vehicle path planning method has been proposed to optimize path length, path safety and path smoothness using the elitist non-dominated sorting genetic algorithm (NSGA-II). Four different path representation schemes that begin its coding from the start point and move one grid at a time towards the destination point are proposed. Minimization of traveled distance, maximization ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2020.3047936